Generalized Holevo theorem and distinguishability notions

Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds

We prove a concise factor-of-two estimate for the failure-rate of optimally distinguishing an arbitrary ensemble of mixed quantum states, generalizing work of Holevo [Theor. Probab. Appl. 23, 411 (1978)] and Curlander [Ph.D. Thesis, MIT, 1979]. A modification of the minimal principle of Concha and Poor [Proceedings of the 6th International Conference on Quantum Communication, Measurement, and C...

Quantum Coding Theorem from Privacy and Distinguishability

Wigner-Araki-Yanase theorem on Distinguishability

Takayuki Miyadera ∗ and Hideki Imai ∗,† ∗ Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST). Daibiru building 1102, Sotokanda, Chiyoda-ku, Tokyo, 101-0021, Japan. (e-mail: [email protected]) † Graduate School of Science and Engineering Course of Electrical, Electronic, and Communication Engineering, Chuo Universit...

Solved and unsolved problems in generalized notions of Connes amenability

We survey the recent investigations on (bounded, sequential) approximate Connes amenability and pseudo-Connes amenability for dual Banach algebras. We will discuss the core problems concerning these notions and address the signicance of any solutions to them to the development of the eld.

Generalized Coherence Concurrence and Path distinguishability

We propose a new family of coherence monotones, named the generalized coherence concurrence (or coherence k-concurrence), which is an analogous concept to the generalized entanglement concurrence. The coherence k-concurrence of a state is nonzero if and only if the coherence number (a recently introduced discrete coherence monotone) of the state is not smaller than k, and a state can be convert...